Maximally nonlocal theories cannot be maximally random.
نویسندگان
چکیده
Correlations that violate a Bell inequality are said to be nonlocal; i.e., they do not admit a local and deterministic explanation. Great effort has been devoted to study how the amount of nonlocality (as measured by a Bell inequality violation) serves to quantify the amount of randomness present in observed correlations. In this work we reverse this research program and ask what do the randomness certification capabilities of a theory tell us about the nonlocality of that theory. We find that, contrary to initial intuition, maximal randomness certification cannot occur in maximally nonlocal theories. We go on and show that quantum theory, in contrast, permits certification of maximal randomness in all dichotomic scenarios. We hence pose the question of whether quantum theory is optimal for randomness; i.e., is it the most nonlocal theory that allows maximal randomness certification? We answer this question in the negative by identifying a larger-than-quantum set of correlations capable of this feat. Not only are these results relevant to understanding quantum mechanics' fundamental features, but also put fundamental restrictions on device-independent protocols based on the no-signaling principle.
منابع مشابه
Fully nonlocal, monogamous, and random genuinely multipartite quantum correlations.
Local measurements on bipartite maximally entangled states can yield correlations that are maximally nonlocal, monogamous, and with fully random outcomes. This makes these states ideal for bipartite cryptographic tasks. Genuine-multipartite nonlocality constitutes a stronger notion of nonlocality in the multipartite case. Maximal genuine-multipartite nonlocality, monogamy, and random outcomes a...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملMaximally Entangled State in Pseudo-Telepathy Games
A pseudo-telepathy game is a nonlocal game which can be won with probability one using some finite-dimensional quantum strategy but not using a classical one. Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. Towards answering this question, we develop conditions under which maximally entangle...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 114 16 شماره
صفحات -
تاریخ انتشار 2015